Evolving Chess Playing Programs
نویسندگان
چکیده
This contribution introduces a hybrid GP/ES system for the evolution of chess playing computer programs. We discuss the basic system and examine its performance in comparison to pre-existing algorithms of the type alphabeta and its improved variants. We can show that evolution is able to outperform these algorithms both in terms of eÆciency and strength.
منابع مشابه
Auditory memory function in expert chess players
Background: Chess is a game that involves many aspects of high level cognition such as memory, attention, focus and problem solving. Long term practice of chess can improve cognition performances and behavioral skills. Auditory memory, as a kind of memory, can be influenced by strengthening processes following long term chess playing like other behavioral skills because of common processing pat...
متن کاملCurrent Chess Programs: a Summary of Their Potential and Limitations*
The purpose of this paper is to discuss ideas used in current chess playing programs. A short history of events leading to the present state of the art is given and a survey made of present day programs. The Newell, Shaw, and Simon program of 1958 is included since it embodies useful ideas that other programs appear not to employ. The possible performance limits for current techniques will be c...
متن کاملSearch Versus Knowledge in Game-Playing Programs Revisited
Perfect knowledge about a domain renders search unnecessary and, likewise, exhaustive search obviates heuristic knowledge. In practise, a tradeoff is found somewhere in the middle, since neither extreme is feasible for interesting domains. During the last two decades, the focus for increasing the performance of two-player game-playing programs has been on enhanced search, usually by faster hard...
متن کاملOptimizing Selective Search in Chess
In this paper we introduce a novel method for automatically tuning the search parameters of a chess program using genetic algorithms. Our results show that a large set of parameter values can be learned automatically, such that the resulting performance is comparable with that of manually tuned parameters of top tournament-playing chess programs.
متن کاملMTD(f), A Minimax Algorithm Faster Than NegaScout
MTD(f) is a new minimax search algorithm, simpler and more efficient than previous algorithms. In tests with a number of tournament game playing programs for chess, checkers and Othello it performed better, on average, than NegaScout/PVS (the AlphaBeta variant used in practically all good chess, checkers, and Othello programs). One of the strongest chess programs of the moment, MIT's parallel c...
متن کامل